Pharmacogenetics: Chasing Perfection

Regenerating Perfection.

Testing perfection is hard

A graph property P is strongly testable if for every fixed > 0 there is a one-sided -tester for P whose query complexity is bounded by a function of . In classifying the strongly testable graph properties, the first author and Shapira showed that any hereditary graph property (such as P the family of perfect graphs) is strongly testable. A property is easily testable if it is strongly testable ...

Chasing Constrained

We investigate the implication problem for constrained tuple-generating dependencies (CTGDs), the extension of tuple-and equality-generating dependencies that permits expression of semantic relations (constraints) on variables. The implication problem is central to identifying redundant integrity constraints, checking integrity constraints on constraint databases, detecting the independence of ...

Chasing chaos

Both simple and hybrid genetic algorithms encounter difficulties when presented with a function which has multiple values. Similarly, changing environments or functions which change rapidly present other problems. This paper presents an algorithm that is capable of coping with both of these scenarios: it can accommodate multiple solutions simultaneously and can track changes in optima efficient...

Profiling, Performance, and Perfection

A profile is “a set of data often in graphic form portraying the significant features of something”. [Web88] Profiles can help us to quickly understand a person or entity better. In the development of computer-based applications, profiles are invaluable. They help us to understand the application – how it works, how well it works, whether it in fact works as we think it does, and whether it is ...